Simple and Flexible Stack Types
نویسندگان
چکیده
Typed intermediate languages and typed assembly languages for optimizing compilers require types to describe stack-allocated data. Previous type systems for stack data were either undecidable or did not treat arguments passed by reference. This paper presents a simple, sound, decidable type system expressive enough to support the Micro-CLI source language, including by-reference arguments. This type system safely expresses operations on aliased stack locations by using singleton pointers and a small subset of linear logic.
منابع مشابه
Experimental Study on a 1000W Dead-End H2/O2 PEM Fuel Cell Stack with Cascade Type for Improving Fuel Utilization
Proton exchange membrane fuel cells (PEMFCs) with a dead-ended anode and cathode can obtain high hydrogen and oxygen utilization by a comparatively simple system. Nevertheless, the accumulation of the water in the anode and cathode channels might cause a local fuel starvation degrading the performance and durability of PEMFCs. In this study, a brand new design for a polymer electrolyte membrane...
متن کاملComponent Framework Technology for Flexible Protocol Stacks
The context of this paper and the corresponding challenges are formed by network services and their requirements to the underlying protocol stack. The relevance of this research is confirmed by three recent trends in network services and their execution environment: growing reliance of businesses and individuals on network connectivity, highly dynamic network characteristics, and a wide range o...
متن کاملA Simple Algorithm for Analyzing a Piled Raft by Considering Stress Distribution
Numerous techniques have been presented by different researchers to analyze piled raft. In order to analyze pile foundation, soil can be modeled as spring, continuous medium, or porous media. Pile can also be modeled as spring or continuous medium. This study includes three main stages: a short description of different types of analysis methods of pile foundation, writing a computer program bas...
متن کاملDecidable Models of Recursive Asynchronous Concurrency
Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable model for recursive programs with asynchronous atomic procedure calls. We study a relaxation of the empty-stack constraint for ACPS that permits concurrency and communication actions at any stack height, called the sha...
متن کاملUTILIZING CONCEPTUAL MODELING IN THE STUDY OF ONE OF THE IRANIAN FRACTURED CARBONATE RESERVOIRS
A typical Iranian carbonate matrix block surrounded by an open fracture was modeled in order to understand the fracture-matrix interaction and realize how to model the interaction best. The modeling was carried out by using a fine-scaled Eclipse model in the single porosity mode (the fractures were explicitly modeled). The model was extended to a stack of 6 matrix blocks to understand block-to-...
متن کامل